// Copyright 2024 The Google Research Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#include "fair-secretary.h"

#include <iostream>
#include <ostream>

namespace fair_secretary {

using std::vector;

FairSecretaryAlgorithm::FairSecretaryAlgorithm(const vector<int>& thre,
                                               int num_colors) {
  thre_ = thre;
  num_colors_ = num_colors;
}

SecretaryInstance FairSecretaryAlgorithm::ComputeSolution(
    const vector<SecretaryInstance>& elements) {
  vector<double> max_color(num_colors_, 0);
  // Compute max values.
  for (int i = 0; i < elements.size(); i++) {
    if (i < thre_[elements[i].color]) {
      max_color[elements[i].color] =
          std::max(max_color[elements[i].color], elements[i].value);
    }
  }
  for (int i = 0; i < elements.size(); i++) {
    if (i >= thre_[elements[i].color]) {
      if (elements[i].value >= max_color[elements[i].color]) {
        return elements[i];
      }
    }
  }
  return SecretaryInstance(-1, -1);
}

}  // namespace fair_secretary
